0.02/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.11	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.32	% Computer : n011.cluster.edu
0.12/0.32	% Model    : x86_64 x86_64
0.12/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory   : 8042.1875MB
0.12/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.32	% CPULimit   : 1920
0.12/0.32	% WCLimit    : 240
0.12/0.32	% DateTime   : Wed Jul 30 09:21:04 EDT 2025
0.12/0.32	% CPUTime    : 
0.20/0.46	Running higher-order theorem proving
0.20/0.52	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p
0.89/0.64	# Version: 3.0.0-ho
0.89/0.64	# Preprocessing class: HSLMSMSMLLLCHSA.
0.89/0.64	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
0.89/0.64	# Starting pre_casc_4 with 960s (4) cores
0.89/0.64	# Starting full_lambda_6 with 240s (1) cores
0.89/0.64	# Starting sh10 with 240s (1) cores
0.89/0.64	# Starting post_as_ho9 with 240s (1) cores
0.89/0.64	# Starting post_as_ho8 with 240s (1) cores
0.89/0.64	# pre_casc_4 with pid 386 completed with status 0
0.89/0.64	# Result found by pre_casc_4
0.89/0.64	# Preprocessing class: HSLMSMSMLLLCHSA.
0.89/0.64	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
0.89/0.64	# Starting pre_casc_4 with 960s (4) cores
0.89/0.64	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.89/0.64	# Search class: HGUSM-FSLM31-DHSMMFBN
0.89/0.64	# partial match(2): HGUSM-FSLM31-DHSFFFBN
0.89/0.64	# Scheduled 6 strats onto 4 cores with 960 seconds (960 total)
0.89/0.64	# Starting new_bool_5 with 432s (1) cores
0.89/0.64	# Starting pre_casc_4 with 97s (1) cores
0.89/0.64	# Starting ehoh_best8_lambda with 108s (1) cores
0.89/0.64	# Starting new_bool_1 with 108s (1) cores
0.89/0.64	# pre_casc_4 with pid 392 completed with status 0
0.89/0.64	# Result found by pre_casc_4
0.89/0.64	# Preprocessing class: HSLMSMSMLLLCHSA.
0.89/0.64	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
0.89/0.64	# Starting pre_casc_4 with 960s (4) cores
0.89/0.64	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.89/0.64	# Search class: HGUSM-FSLM31-DHSMMFBN
0.89/0.64	# partial match(2): HGUSM-FSLM31-DHSFFFBN
0.89/0.64	# Scheduled 6 strats onto 4 cores with 960 seconds (960 total)
0.89/0.64	# Starting new_bool_5 with 432s (1) cores
0.89/0.64	# Starting pre_casc_4 with 97s (1) cores
0.89/0.64	# Preprocessing time       : 0.006 s
0.89/0.64	# Presaturation interreduction done
0.89/0.64	
0.89/0.64	# Proof found!
0.89/0.64	# SZS status Theorem
0.89/0.64	# SZS output start CNFRefutation
0.89/0.64	thf(decl_23, type, is_of: $i > ($i > $o) > $o).
0.89/0.64	thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o).
0.89/0.64	thf(decl_26, type, in: $i > $i > $o).
0.89/0.64	thf(decl_73, type, l_some: $i > ($i > $o) > $o).
0.89/0.64	thf(decl_78, type, e_is: $i > $i > $i > $o).
0.89/0.64	thf(decl_124, type, nat: $i).
0.89/0.64	thf(decl_125, type, n_is: $i > $i > $o).
0.89/0.64	thf(decl_128, type, n_some: ($i > $o) > $o).
0.89/0.64	thf(decl_143, type, n_pl: $i > $i > $i).
0.89/0.64	thf(decl_148, type, diffprop: $i > $i > $i > $o).
0.89/0.64	thf(decl_149, type, d_29_ii: $i > $i > $o).
0.89/0.64	thf(decl_163, type, n_ts: $i > $i > $i).
0.89/0.64	thf(decl_190, type, frac: $i).
0.89/0.64	thf(decl_192, type, num: $i > $i).
0.89/0.64	thf(decl_193, type, den: $i > $i).
0.89/0.64	thf(decl_194, type, n_eq: $i > $i > $o).
0.89/0.64	thf(decl_195, type, moref: $i > $i > $o).
0.89/0.64	thf(decl_199, type, n_pf: $i > $i > $i).
0.89/0.64	thf(decl_201, type, d_367_w: $i > $i > $i).
0.89/0.64	thf(decl_202, type, esk1_0: $i).
0.89/0.64	thf(decl_203, type, esk2_0: $i).
0.89/0.64	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_e_is)).
0.89/0.64	thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_diffprop)).
0.89/0.64	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_n_is)).
0.89/0.64	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_d_29_ii)).
0.89/0.64	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_all_of)).
0.89/0.64	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_is_of)).
0.89/0.64	thf(def_n_eq, axiom, ((n_eq)=(^[X1:$i, X218:$i]:((n_is @ (n_ts @ (num @ X1) @ (den @ X218)) @ (n_ts @ (num @ X218) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_n_eq)).
0.89/0.64	thf(def_moref, axiom, ((moref)=(^[X1:$i, X219:$i]:((d_29_ii @ (n_ts @ (num @ X1) @ (den @ X219)) @ (n_ts @ (num @ X219) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_moref)).
0.89/0.64	thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', def_n_some)).
0.89/0.64	thf(k_satz67c, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X550:$i]:((in @ X550 @ frac))) @ (^[X551:$i]:(((moref @ X1 @ X551)=>(n_eq @ (n_pf @ X551 @ (d_367_w @ X1 @ X551)) @ X1)))))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', k_satz67c)).
0.89/0.64	thf(satz67d, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X438:$i]:((in @ X438 @ frac))) @ (^[X439:$i]:(((n_eq @ X1 @ (n_pf @ X439 @ (d_367_w @ X1 @ X439)))<=(moref @ X1 @ X439)))))))), file('/export/starexec/sandbox2/tmp/tmp.9dNttJbC9i/E---3.1_308.p', satz67d)).
0.89/0.64	thf(c_0_11, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.89/0.64	thf(c_0_12, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])).
0.89/0.64	thf(c_0_13, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_11])).
0.89/0.64	thf(c_0_14, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
0.89/0.64	thf(c_0_15, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_12, c_0_13])).
0.89/0.64	thf(c_0_16, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.89/0.64	thf(c_0_17, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.89/0.64	thf(c_0_18, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(fof_simplification,[status(thm)],[def_n_eq])).
0.89/0.64	thf(c_0_19, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2)))))))))), inference(fof_simplification,[status(thm)],[def_moref])).
0.89/0.64	thf(c_0_20, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_15]), def_n_some])).
0.89/0.64	thf(c_0_21, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_16, c_0_17])).
0.89/0.64	thf(c_0_22, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(apply_def,[status(thm)],[c_0_18, c_0_13])).
0.89/0.64	thf(c_0_23, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2)))))))))), inference(apply_def,[status(thm)],[c_0_19, c_0_20])).
0.89/0.64	thf(c_0_24, plain, ![X684:$i]:(((in @ X684 @ frac)=>![X683:$i]:(((in @ X683 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X684) @ (den @ X683))=(n_pl @ (n_ts @ (num @ X683) @ (den @ X684)) @ Z0)))))=>((n_ts @ (num @ (n_pf @ X683 @ (d_367_w @ X684 @ X683))) @ (den @ X684))=(n_ts @ (num @ X684) @ (den @ (n_pf @ X683 @ (d_367_w @ X684 @ X683)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[k_satz67c]), c_0_21]), c_0_22]), c_0_23])).
0.89/0.64	thf(c_0_25, negated_conjecture, ~(![X621:$i]:(((in @ X621 @ frac)=>![X620:$i]:(((in @ X620 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X621) @ (den @ X620))=(n_pl @ (n_ts @ (num @ X620) @ (den @ X621)) @ Z0)))))=>((n_ts @ (num @ X621) @ (den @ (n_pf @ X620 @ (d_367_w @ X621 @ X620))))=(n_ts @ (num @ (n_pf @ X620 @ (d_367_w @ X621 @ X620))) @ (den @ X621))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz67d])]), c_0_21]), c_0_22]), c_0_23])])).
0.89/0.64	thf(c_0_26, plain, ![X1009:$i, X1010:$i]:((~(in @ X1009 @ frac)|(~(in @ X1010 @ frac)|(~(l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X1009) @ (den @ X1010))=(n_pl @ (n_ts @ (num @ X1010) @ (den @ X1009)) @ Z0)))))|((n_ts @ (num @ (n_pf @ X1010 @ (d_367_w @ X1009 @ X1010))) @ (den @ X1009))=(n_ts @ (num @ X1009) @ (den @ (n_pf @ X1010 @ (d_367_w @ X1009 @ X1010))))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])).
0.89/0.64	thf(c_0_27, negated_conjecture, ((in @ esk1_0 @ frac)&((in @ esk2_0 @ frac)&((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ esk1_0) @ (den @ esk2_0))=(n_pl @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ Z0)))))&((n_ts @ (num @ esk1_0) @ (den @ (n_pf @ esk2_0 @ (d_367_w @ esk1_0 @ esk2_0))))!=(n_ts @ (num @ (n_pf @ esk2_0 @ (d_367_w @ esk1_0 @ esk2_0))) @ (den @ esk1_0)))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])).
0.89/0.64	thf(c_0_28, plain, ![X4:$i, X1:$i]:((((n_ts @ (num @ (n_pf @ X4 @ (d_367_w @ X1 @ X4))) @ (den @ X1))=(n_ts @ (num @ X1) @ (den @ (n_pf @ X4 @ (d_367_w @ X1 @ X4)))))|~((in @ X1 @ frac))|~((in @ X4 @ frac))|~((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X1) @ (den @ X4))=(n_pl @ (n_ts @ (num @ X4) @ (den @ X1)) @ Z0)))))))), inference(split_conjunct,[status(thm)],[c_0_26])).
0.89/0.64	thf(c_0_29, negated_conjecture, (l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ esk1_0) @ (den @ esk2_0))=(n_pl @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ Z0))))), inference(split_conjunct,[status(thm)],[c_0_27])).
0.89/0.64	thf(c_0_30, negated_conjecture, (in @ esk2_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])).
0.89/0.64	thf(c_0_31, negated_conjecture, (in @ esk1_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])).
0.89/0.64	thf(c_0_32, negated_conjecture, ((n_ts @ (num @ esk1_0) @ (den @ (n_pf @ esk2_0 @ (d_367_w @ esk1_0 @ esk2_0))))!=(n_ts @ (num @ (n_pf @ esk2_0 @ (d_367_w @ esk1_0 @ esk2_0))) @ (den @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_27])).
0.89/0.64	thf(c_0_33, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31])]), c_0_32]), ['proof']).
0.89/0.64	# SZS output end CNFRefutation
0.89/0.64	# Parsed axioms                        : 613
0.89/0.64	# Removed by relevancy pruning/SinE    : 451
0.89/0.64	# Initial clauses                      : 160
0.89/0.64	# Removed in clause preprocessing      : 12
0.89/0.64	# Initial clauses in saturation        : 148
0.89/0.64	# Processed clauses                    : 305
0.89/0.64	# ...of these trivial                  : 2
0.89/0.64	# ...subsumed                          : 50
0.89/0.64	# ...remaining for further processing  : 253
0.89/0.64	# Other redundant clauses eliminated   : 20
0.89/0.64	# Clauses deleted for lack of memory   : 0
0.89/0.64	# Backward-subsumed                    : 0
0.89/0.64	# Backward-rewritten                   : 5
0.89/0.64	# Generated clauses                    : 493
0.89/0.64	# ...of the previous two non-redundant : 458
0.89/0.64	# ...aggressively subsumed             : 0
0.89/0.64	# Contextual simplify-reflections      : 0
0.89/0.64	# Paramodulations                      : 281
0.89/0.64	# Factorizations                       : 0
0.89/0.64	# NegExts                              : 0
0.89/0.64	# Equation resolutions                 : 21
0.89/0.64	# Disequality decompositions           : 0
0.89/0.64	# Total rewrite steps                  : 50
0.89/0.64	# ...of those cached                   : 26
0.89/0.64	# Propositional unsat checks           : 0
0.89/0.64	#    Propositional check models        : 0
0.89/0.64	#    Propositional check unsatisfiable : 0
0.89/0.64	#    Propositional clauses             : 0
0.89/0.64	#    Propositional clauses after purity: 0
0.89/0.64	#    Propositional unsat core size     : 0
0.89/0.64	#    Propositional preprocessing time  : 0.000
0.89/0.64	#    Propositional encoding time       : 0.000
0.89/0.64	#    Propositional solver time         : 0.000
0.89/0.64	#    Success case prop preproc time    : 0.000
0.89/0.64	#    Success case prop encoding time   : 0.000
0.89/0.64	#    Success case prop solver time     : 0.000
0.89/0.64	# Current number of processed clauses  : 134
0.89/0.64	#    Positive orientable unit clauses  : 47
0.89/0.64	#    Positive unorientable unit clauses: 0
0.89/0.64	#    Negative unit clauses             : 14
0.89/0.64	#    Non-unit-clauses                  : 73
0.89/0.64	# Current number of unprocessed clauses: 393
0.89/0.64	# ...number of literals in the above   : 1910
0.89/0.64	# Current number of archived formulas  : 0
0.89/0.64	# Current number of archived clauses   : 111
0.89/0.64	# Clause-clause subsumption calls (NU) : 8341
0.89/0.64	# Rec. Clause-clause subsumption calls : 1263
0.89/0.64	# Non-unit clause-clause subsumptions  : 47
0.89/0.64	# Unit Clause-clause subsumption calls : 142
0.89/0.64	# Rewrite failures with RHS unbound    : 0
0.89/0.64	# BW rewrite match attempts            : 13
0.89/0.64	# BW rewrite match successes           : 5
0.89/0.64	# Condensation attempts                : 0
0.89/0.64	# Condensation successes               : 0
0.89/0.64	# Termbank termtop insertions          : 70224
0.89/0.64	# Search garbage collected termcells   : 21677
0.89/0.64	
0.89/0.64	# -------------------------------------------------
0.89/0.64	# User time                : 0.071 s
0.89/0.64	# System time              : 0.009 s
0.89/0.64	# Total time               : 0.080 s
0.89/0.64	# Maximum resident set size: 6228 pages
0.89/0.64	
0.89/0.64	# -------------------------------------------------
0.89/0.64	# User time                : 0.224 s
0.89/0.64	# System time              : 0.031 s
0.89/0.64	# Total time               : 0.254 s
0.89/0.64	# Maximum resident set size: 2900 pages
0.89/0.64	% E exiting
0.89/0.64	% E exiting
0.89/0.64	EOF